Law of addition in random matrix theory
نویسنده
چکیده
We discuss the problem of adding random matrices, which enable us to study Hamiltonians consisting of a deterministic term plus a random term. Using a diagrammatic approach and introducing the concept of “gluon connectedness,” we calculate the density of energy levels for a wide class of probability distributions governing the random term, thus generalizing a result obtained recently by Brézin, Hikami, and Zee. The method used here may be applied to a broad class of problems involving random matrices.
منابع مشابه
APPLICATION OF THE RANDOM MATRIX THEORY ON THE CROSS-CORRELATION OF STOCK PRICES
The analysis of cross-correlations is extensively applied for understanding of interconnections in stock markets. Variety of methods are used in order to search stock cross-correlations including the Random Matrix Theory (RMT), the Principal Component Analysis (PCA) and the Hierachical Structures. In this work, we analyze cross-crrelations between price fluctuations of 20 company stocks...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملA Block-Wise random sampling approach: Compressed sensing problem
The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...
متن کاملMARCINKIEWICZ-TYPE STRONG LAW OF LARGE NUMBERS FOR DOUBLE ARRAYS OF NEGATIVELY DEPENDENT RANDOM VARIABLES
In the following work we present a proof for the strong law of large numbers for pairwise negatively dependent random variables which relaxes the usual assumption of pairwise independence. Let be a double sequence of pairwise negatively dependent random variables. If for all non-negative real numbers t and , for 1 < p < 2, then we prove that (1). In addition, it also converges to 0 in ....
متن کاملMRA parseval frame multiwavelets in L^2(R^d)
In this paper, we characterize multiresolution analysis(MRA) Parseval frame multiwavelets in L^2(R^d) with matrix dilations of the form (D f )(x) = sqrt{2}f (Ax), where A is an arbitrary expanding dtimes d matrix with integer coefficients, such that |detA| =2. We study a class of generalized low pass matrix filters that allow us to define (and construct) the subclass of MRA tight frame multiwa...
متن کامل